Tableau Switching: Algorithms and Applications
نویسندگان
چکیده
منابع مشابه
Tableau Switching: Algorithms and Applications
We deene and characterize switching, an operation that takes two tableaux sharing a common border and \moves them through each other" giving another such pair. Several authors, including James and Kerber, Remmel, Haiman, and Shimozono, have deened switching operations; however, each of their operations is somewhat diierent from the rest and each imposes a particular order on the switches that c...
متن کاملTableau Algorithms for Description Logics
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satissability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description ...
متن کاملDiscrete Tableau Algorithms for FSHI
A variety of fuzzy description logics are proposed to extend classical description logics with fuzzy capability. However, reasoning with general TBoxes is still an open problem in fuzzy description logics. In this paper, we present a novel discrete tableau algorithm for a given fuzzy description logic FSHI with general TBoxes, which tries to construct discrete tableaus of FSHI knowledge bases. ...
متن کاملSemi-primary Lattices and Tableau Algorithms
We develop the theory of semi-primary lattices, a class of modular lattices, including abelian subgroup lattices and invariant subspace lattices, in which an integer partition is assigned to every element and every interval. Flags in these lattices give rise to chains of partitions, which may be encoded as tableaux. In certain of these lattices, Steinberg and van Leeuwen respectively have shown...
متن کاملTableau algorithms defined naturally for pictures
The following text is an annotation to Marc A. A. van Leeuwen's paper " Tableau algorithms defined naturally for pictures " in its version of 25 November 2011. This annotation contains corrections of a few mistakes. Different comments are separated by horizontal lines, like this: Page 1, §1: Replace " as a tableaux " by " as tableaux ". Page 3, §2.2: Replace " The the non-empty " by " The non-e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1996
ISSN: 0097-3165
DOI: 10.1006/jcta.1996.0086